On the Enumerative Geometry of Aspect Graphs
نویسنده
چکیده
Most of the work achieved thus far on aspect graphs has concentrated on the design of algorithms for computing the representation. After reviewing how the space of viewpoints can be partitioned in view-equivalent cells, we work in this paper on a more theoretical level to give enumerative properties of the di erent entities entering in the construction of aspect graphs of objects bounded by smooth algebraic surfaces. We show how tools from algebraic geometry can be used to compute their projective characters and other numerical invariants.
منابع مشابه
The Complexity and Enumerative Geometry of Aspect Graphs of Smooth Surfaces
Aspect graphs have been the object of very active research by the computer vision community in recent years, but most of it has concentrated on the design of algorithms to compute the representation. In this paper, we work on a more theoretical level to give enumerative properties of the di erent entities entering in the construction of aspect graphs of objects bounded by smooth surfaces, namel...
متن کاملThe Number of Views of Piecewise-Smooth Algebraic Objects
A solid object in 3-dimensional space may be described by a collection of all its topologically distinct 2-dimensional appearances, its aspect graph. In this paper, we study the complexity of aspect graphs of piecewise-smooth algebraic objects using the modern tools of algebraic geometry, i.e. intersection theory, multiple-point theory and enumerative geometry. We give a bound on the number of ...
متن کاملEnumerative Properties of Ferrers Graphs
We define a class of bipartite graphs that correspond naturally with Ferrers diagrams. We give expressions for the number of spanning trees, the number of Hamiltonian paths when applicable, the chromatic polynomial and the chromatic symmetric function. We show that the linear coefficient of the chromatic polynomial is given by the excedance set statistic.
متن کاملQuantum curves for the enumeration of ribbon graphs and hypermaps
The topological recursion of Eynard and Orantin governs a variety of problems in enumerative geometry and mathematical physics. The recursion uses the data of a spectral curve to define an infinite family of multidifferentials. It has been conjectured that, under certain conditions, the spectral curve possesses a non-commutative quantisation whose associated differential operator annihilates th...
متن کاملMany 2-Level Polytopes from Matroids
The family of 2-level matroids, that is, matroids whose base polytope is 2-level, has been recently studied and characterized by means of combinatorial properties. 2-level matroids generalize series-parallel graphs, which have been already successfully analyzed from the enumerative perspective. We bring to light some structural properties of 2-level matroids and exploit them for enumerative pur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994